On the Relation between Sized-Types Based Termination and Semantic Labelling
نویسندگان
چکیده
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard’s reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the semantics of its arguments, and applies to any rewrite system. First, we introduce a simplified version of SBT for the simply-typed lambda-calculus. Then, we give new proofs of the correctness of SBT using semantic labelling, both in the first and in the higher-order case. As a consequence, we show that SBT can be extended to systems using matching on defined symbols (e.g. associative functions).
منابع مشابه
On the relation between size-based termination and semantic labelling
We investigate the relationship between two independently developed termination techniques. On the one hand, sized-types based termination (SBT) uses types annotated with size expressions and Girard's reducibility candidates, and applies on systems using constructor matching only. On the other hand, semantic labelling transforms a rewrite system by annotating each function symbol with the seman...
متن کاملEquational Termination by Semantic Labelling
Semantic labelling is a powerful tool for proving termination of term rewrite systems. The usefulness of the extension to equational term rewriting described in Zantema [24] is however rather limited. In this paper we introduce a stronger version of equational semantical labelling, parameterized by three choices: (1) the order on the underlying algebra (partial order vs. quasi-order), (2) the r...
متن کاملSemantic Labelling for Termination of Combinatory Reduction Systems
We give a method of proving termination of Klop’s higher-order rewriting format, combinatory reduction system (CRS). Our method called higher-order semantic labelling is an extension of Zantema’s semantic labelling for first-order term rewriting systems. We systematically define the labelling by using the complete algebraic semantics of CRS.
متن کاملThe Semantic and Rhetorical Function of the Synonymous and Antonymous Concepts of “Infaq” in the Holy Quran
The syntagmatic (descriptive) semantic approach is an attempt to represent the words and their relations existing in the human mind. Considering this idea, the present paper, while applying this approach, seeks to provide a descriptive analysis of the concept of infaq and to explain the semantic and rhetorical function of the concepts that having a syntagmatic relation with it are sometimes use...
متن کاملSemantic Labelling for Proving Termination of Combinatory Reduction Systems
We give a novel transformation method for proving termination of higher-order rewrite rules in Klop’s format called Combinatory Reduction System (CRS). The format CRS essentially covers the usual pure higher-order functional programs such as Haskell. Our method called higher-order semantic labelling is an extension of a method known in the theory of term rewriting. This attaches semantics of th...
متن کامل